Fast Search

Results: 263



#Item
11That was fast! Speeding up NN search of high dimensional distributions. Emanuele Coviello University of California, San Diego, 9500 Gilman Dr, La Jolla, CA 92093

That was fast! Speeding up NN search of high dimensional distributions. Emanuele Coviello University of California, San Diego, 9500 Gilman Dr, La Jolla, CA 92093

Add to Reading List

Source URL: eceweb.ucsd.edu

Language: English - Date: 2015-07-31 19:02:39
12Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
13QUAD TREE SPATIAL SPECTRA GUIDE: A FAST SPATIAL HEURISTIC SEARCH IN A LARGE GIS Zi-Tan Chcn Donna Peuquet  Geography Dept , Univ of California,

QUAD TREE SPATIAL SPECTRA GUIDE: A FAST SPATIAL HEURISTIC SEARCH IN A LARGE GIS Zi-Tan Chcn Donna Peuquet Geography Dept , Univ of California,

Add to Reading List

Source URL: mapcontext.com

Language: English - Date: 2008-08-30 00:14:46
14RISOTTO: Fast extraction of motifs with mismatches Nadia Pisanti‡ , Alexandra M. Carvalho◦∗, Laurent Marsan∓ and Marie-France Sagot ◦ INESC-ID, Lisbon INRIA Rhˆ

RISOTTO: Fast extraction of motifs with mismatches Nadia Pisanti‡ , Alexandra M. Carvalho◦∗, Laurent Marsan∓ and Marie-France Sagot ◦ INESC-ID, Lisbon INRIA Rhˆ

Add to Reading List

Source URL: pbil.univ-lyon1.fr

Language: English - Date: 2008-10-22 02:35:23
15That was fast! Speeding up NN search of high dimensional distributions.

That was fast! Speeding up NN search of high dimensional distributions.

Add to Reading List

Source URL: eceweb.ucsd.edu

Language: English - Date: 2015-07-31 19:00:25
16Fast Concurrent AVL Trees Erik Henriksson December 16th, 2013 Fast Concurrent AVL Trees

Fast Concurrent AVL Trees Erik Henriksson December 16th, 2013 Fast Concurrent AVL Trees

Add to Reading List

Source URL: spcl.inf.ethz.ch

Language: English - Date: 2014-01-10 05:34:47
17Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †

Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:12
18FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION Marius Muja, David G. Lowe Computer Science Department, University of British Columbia, Vancouver, B.C., Canada ,

FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION Marius Muja, David G. Lowe Computer Science Department, University of British Columbia, Vancouver, B.C., Canada ,

Add to Reading List

Source URL: www.geog.ucsb.edu

Language: English - Date: 2013-05-14 18:54:15
19MediaClone Market Positioning Vision Statement MediaClone is the leading provider of Mobile Computer Forensic Units - Complete Investigation Platforms for field operations; Secure and Economical Devices for Fast Data Era

MediaClone Market Positioning Vision Statement MediaClone is the leading provider of Mobile Computer Forensic Units - Complete Investigation Platforms for field operations; Secure and Economical Devices for Fast Data Era

Add to Reading List

Source URL: www.media-clone.net

Language: English - Date: 2015-07-31 13:11:05
20JOURNAL OF COMPUTATIONAL BIOLOGY Volume 6, Numbers 3/4, 1999 Mary Ann Liebert, Inc. Pp. 369– 386  Disk-Covering, a Fast-Converging Method

JOURNAL OF COMPUTATIONAL BIOLOGY Volume 6, Numbers 3/4, 1999 Mary Ann Liebert, Inc. Pp. 369– 386 Disk-Covering, a Fast-Converging Method

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2016-05-15 16:25:24